SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary se